New Heuristics for Morpion Solitaire
نویسندگان
چکیده
Morpion Solitaire is a popular paper-and-pencil game. We investigate random sampling and simulated annealing algorithms for disjoint and touching models of the game. Our experiments show that simulated annealing (SA) works quite well and fast. We used it to find the best known results for non-trivial cases of the disjoint model.
منابع مشابه
Reflexive Monte-Carlo Search
Reflexive Monte-Carlo search uses the Monte-Carlo search of a given level to improve the search of the upper level. We describe the application to Morpion Solitaire. For the non touching version, reflexive Monte-Carlo search breaks the current record and establishes a new record of 78 moves.
متن کاملMorpion Solitaire 5D: a new upper bound 121 on the maximum score
Morpion Solitaire is a pencil-and-paper game for a single player. A move in this game consists of putting a cross at a lattice point and then drawing a line segment that passes through exactly five consecutive crosses. The objective is to make as many moves as possible, starting from a standard initial configuration of crosses. For one of the variants of this game, called 5D, we prove an upper ...
متن کاملNested Rollout Policy Adaptation for Monte Carlo Tree Search
Monte Carlo tree search (MCTS) methods have had recent success in games, planning, and optimization. MCTS uses results from rollouts to guide search; a rollout is a path that descends the tree with a randomized decision at each ply until reaching a leaf. MCTS results can be strongly influenced by the choice of appropriate policy to bias the rollouts. Most previous work on MCTS uses static unifo...
متن کاملInvestigating Monte-Carlo Methods on the Weak Schur Problem
Nested Monte-Carlo Search (NMC) and Nested Rollout Policy Adaptation (NRPA) are Monte-Carlo tree search algorithms that have proved their efficiency at solving one-player game problems, such as morpion solitaire or sudoku 16x16, showing that these heuristics could potentially be applied to constraint problems. In the field of Ramsey theory, the weak Schur number WS(k) is the largest integer n f...
متن کاملSearching Solitaire in Real Time
This article presents a new real-time heuristic search method for planning problems with distinct stages. Our multistage nested rollout algorithm allows the user to apply separate heuristics at each stage of the search process and tune the search magnitude for each stage. We propose a searchtree compression that reveals a new state representation for the games of Klondike Solitaire and Thoughtf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007